Rigid linear binary codes

New Binary Linear Codes

Binary Linear Block Codes

Binary linear complementary dual codes

Linear complementary dual codes (or codes with complementary duals) are codes whose intersections with their dual codes are trivial. We study binary linear complementary dual [n, k] codes with the largest minimum weight among all binary linear complementary dual [n, k] codes. We characterize binary linear complementary dual codes with the largest minimum weight for small dimensions. A complete ...

Relating propelinear and binary G-linear codes

In this paper we establish the connections between two di7erent extensions of Z4-linearity for binary Hamming spaces. We present both notions – propelinearity and G-linearity – in the context of isometries and group actions, taking the viewpoint of geometrically uniform codes extended to discrete spaces. We show a double inclusion relation: binary G-linear codes are propelinear codes, and trans...

Normality of some binary linear codes

We show that all binary codes of lengths 16, 17 and 18, or redundancy 10, are normal. These results have applications in the construction of codes that attain t[n, k], the smallest covering radius of any binary linear code.